An Exact Formula for all Star-Kipas Ramsey Numbers
نویسندگان
چکیده
Let G1 and G2 be two given graphs. The Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or G contains a G2. A complete bipartite graph K1,n is called a star. The kipas ̂ Kn is the graph obtained from a path of order n by adding a new vertex and joining it to all the vertices of the path. Alternatively, a kipas is a wheel with one edge on the rim deleted. Whereas for star-wheel Ramsey numbers not all exact values are known to date, in contrast we determine all exact values of star-kipas Ramsey numbers.
منابع مشابه
Closing the Gap on Path-Kipas Ramsey Numbers
⇤The first author is partly supported by the Doctorate Foundation of Northwestern Polytechnical University (No. cx201202) and by the project NEXLIZ-CZ.1.07/2.3.00/30.0038, which is co-financed by the European Social Fund and the state budget of the Czech Republic. †Research partly supported by project P202/12/G061 of the Czech Science Foundation. the electronic journal of combinatorics 22(3) (2...
متن کاملProof of a conjecture on fractional Ramsey numbers
Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, . . . ,ak) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case k=2. In this article, we answer an open problem by determining an explicit formula for the general case k>2 by constructing an infinite family of circulant...
متن کاملGraph classes and Ramsey numbers
For a graph class G and any two positive integers i and j, the Ramsey number RG(i, j) is the smallest positive integer such that every graph in G on at least RG(i, j) vertices has a clique of size i or an independent set of size j. For the class of all graphs, Ramsey numbers are notoriously hard to determine, and they are known only for very small values of i and j. Even if we restrict G to be ...
متن کاملPath-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, K̂m), where Pn is a path on n vertices and K̂m is the graph obtained from the join of K1 and Pm. We determine the ...
متن کامل1 7 O ct 2 01 7 Projective planes and set multipartite Ramsey numbers for C 4 versus star Claudia
Set multipartite Ramsey numbers were introduced in 2004, generalizing the celebrated Ramsey numbers. Let C4 denote the four cycle and let K1,n denote the star on n + 1 vertices. In this paper we investigate bounds on C4−K1,n set multipartite Ramsey numbers. Relationships between these numbers and the classical C4−K1,n Ramsey numbers are explored. Then several near-optimal or exact classes are d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 33 شماره
صفحات -
تاریخ انتشار 2017